Integer codes correcting burst and random asymmetric errors within a byte
نویسندگان
چکیده
منابع مشابه
On Linear Codes Correcting Random and Low-Denslty Burst Errors
This paper presents lower and upper bounds on the number of parity-check digits required for a linear code that corrects random errors and errors which are in the form of low-density bursts.
متن کاملCodes Correcting Repeated Burst Errors Blockwise
This paper obtains bounds for linear codes which are capable to correct the errors blockwise which occur during the process of transmission. The kind of errors considered are known as repeated burst errors of length b(fixed), introduced by Dass and Garg (2009). An illustration for such kind of codes has also been provided. Mathematics Subject Classification: 94B20, 94B25, 94B65
متن کاملPerfect Byte-Correcting Codes
We present a few new constructions for perfect linear single byte-correcting codes. These constructions generate some perfect single byte-correcting codes with new parameters, and some perfect single bytecorrecting codes with known parameters and simpler presentation and implementation over the known codes. It is also shown that nonequivalent perfect linear single byte-correcting codes exist wh...
متن کاملSpatially correlated qubit errors and burst-correcting quantum codes
We explore the design of quantum error-correcting codes for cases where the decoherence events of qubits are correlated. In particular, we consider the case where only spatially contiguous qubits decohere, which is analogous to the case of burst errors in classical coding theory. We present several different efficient schemes for constructing families of such codes. For example, we construct a ...
متن کاملCodes Correcting Phased Burst Erasures
We introduce a family of binary array codes of size t n, correcting multiple phased burst erasures of size t. The codes achieve maximal correcting capability, i.e. being considered as codes over GF (2 t ) they are MDS. The length of the codes is n = P L `=1 t ` , where L is a constant or is slowly growing in t. The complexity of encoding and decoding is proportional to rnmL, where r is the numb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Franklin Institute
سال: 2018
ISSN: 0016-0032
DOI: 10.1016/j.jfranklin.2017.11.033